NP-Completeness of Minimum Rule Sets
نویسندگان
چکیده
Rule induction systems seek to generate rule sets which are optimal in the complexity of the rule set. This paper develops a formal proof of the NP-Completeness of the problem of generating the simplest rule set (MIN RS) which accurately predicts examples in the training set for a particular type of generalization algorithm algorithm and complexity measure. The proof is then informally extended to cover a broader spectrum of complexity measures and learning algorithms.
منابع مشابه
Cohabitation of Independent Sets and Dominating Sets in Trees
We give a constructive characterization of trees that have a maximum independent set and a minimum dominating set which are disjoint and show that the corresponding decision problem is NP-complete for general graphs.
متن کاملThe overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements needed to form such a representation. We find the overlap numbers of cliques and complete bipartite graphs by relating the problem to previous research in combi...
متن کاملOn the Pagenumber of Bipartite Orders
The pagenumber problem for ordered sets is known to be NP-complete, even if the order of the elements on the spine is fixed. In this paper, we investigate this problem for some classes of ordered sets. We provide an efficient algorithm for drawing bipartite interval orders in the minimum number of pages needed. We also give an upper bound for the pagenumber of general bipartite ordered sets and...
متن کاملRotations in the stable b-matching problem
This paper deals with the stable b-matching problem on general multigraphs. We generalize the notion of singular and dual rotation and establish a one-one correspondence between stable b-matchings and certain sets of rotations. This correspondence is used to find all stable edges and a minimum regret stable b-matching in polynomial time. We also recall the NP-completeness of the egalitarian sta...
متن کاملRigid E-Unification: NP-Completeness and Applications to Equational Matings
Rigid E-unification is a restricted kind of unification modulo equational theories, or E-unification, that arises naturally in extending Andrews's theorem proving method of matings to first-order languages with equality. This extension was first presented in Gallier, Raatz, and Snyder, where it was conjectured that rigid Eunification is decidable. In this paper, it is shown that rigid E-unifica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007